A class of programming problems whose objective function contains a norm
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملApproximating a class of combinatorial problems with rational objective function
In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a0 + a1x1 + · · · + anxn subject to certain constraints to solve the problem of minimizing a rational function of the form (a0+a1x1+· · ·+anxn)/(b0+b1x1+· · ·+bnxn) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assump...
متن کاملNorm–Based Approximation in Invex Multi- Objective Programming Problems
This paper addresses the problem of capturing nondominated points on convex Pareto frontiers, which are encountered in invex multi-objective programming problems. An algorithm to find a piecewise linear approximation of the nondominated set of convex Pareto frontier are applied. Index Term-Approximation, Nondominated points, Invex multi-objective problems, Block norms.
متن کاملa new approach to solve multiple objective programming problems
multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1978
ISSN: 0021-9045
DOI: 10.1016/0021-9045(78)90091-6